A functional framework for the implementation of genetic algorithms : comparing Haskell and Standard ML ( extended abstract )
نویسندگان
چکیده
We have used this framework to implement a number of exemplar GAs from the literature, and an original GA to solve a problem in oil-well exploration. Our framework provides precise control over the stochastic processes underlying the GA, which allows for experimentation. The time taken to implement a GA using our framework is significantly reduced. As well as providing a generic implementation for much of the GA, it is also easy to re-use code from other GAs.
منابع مشابه
A functional framework for the implementation of genetic algorithms: Comparing Haskell and Standard ML
We present our experience of developing a generic functional framework for the implementation of genetic algorithms (GAs). We have implemented two versions of the framework, one in Haskell and the other in Standard ML. This paper describes the structure of the framework, and compares the performance of the two versions using the Royal Road Problem in genetic algorithms. The Haskell version is f...
متن کاملA Framework for Verified Depth-First Algorithms
We present a framework in Isabelle/HOL for formalizing variants of depth-first search. This framework allows to easily prove non-trivial properties of these variants. Moreover, verified code in several programming languages including Haskell, Scala and Standard ML can be generated. In this paper, we present an abstract formalization of depth-first search and demonstrate how it is refined to an ...
متن کاملMonads for Incremental Computing Functional Pearl
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to perform an incremental amount of computation to accommodate for changes in input data. Recently, Acar, Blelloch and Harper presented a small Standard ML library that supports efficient, high-level incremental computat...
متن کاملPhantom Types
Phantom types are data types with type constraints associated with different cases. Examples of phantom types include typed type representations and typed higher-order abstract syntax trees. These types can be used to support typed generic functions, dynamic typing, and staged compilation in higher-order, statically typed languages such as Haskell or Standard ML. In our system, type constraints...
متن کاملParallel heuristic search in Haskell
Parallel heuristic search algorithms are widely used in artificial intelligence. This paper describes novel parallel variants of two standard sequential search algorithms, the standard Davis Putnam algorithm (DP); and the same algorithm extended with conflict-directed backjumping (CBJ). Encouraging preliminary results for the GpH parallel dialect of the non-strict functional programming languag...
متن کامل